Improved Results for Stackelberg Scheduling Strategies

نویسندگان

  • V. S. Anil Kumar
  • Madhav V. Marathe
چکیده

We continue the study initiated in [Ro01] on Stackelberg Scheduling Strategies. We are given a set of independent parallel machines or equivalently a set of parallel edges on which certain flow has to be sent. Each edge is endowed with a latency function . The setting is that of a non-cooperative game: players choose edges so as minimize their individual latencies. Additionally, there is a single player who control as fraction of the total flow. The goal is to find a strategy for the leader (i.e. an assignment of flow to indivual links) such that the selfish users react so as to minimize the total latency of the system. Building on the recent results in [Ro01, RT00], we show the following: 1. We devise a fully polynomial approximate Stackelberg scheme: given a performance requirement , the stackelberg scheme runs in time polynomial in and and produces an assignment of flows such that the cost of the induced Nash equilibrium is within a factor of the optimum stackelberg strategy . The result is extended to obtain a polynomial-approximation scheme when instances are restricted to layered directed graphs in which each layer has a bounded number of vertices. 2. We then consider a two round Stackelberg strategy (denoted 2SS). In this strategy, the game consists of three rounds: a move by the leader followed by the moves of all the followers folowed again by a move by the leader who possibly reassigns some of the flows. We show that 2SS always dominates the one round scheme, and for some classes of latency functions, is guaranteed to be closer to the global social optimum. We also consider the variant where the leader plays after the selfish users have routed themselves, and observe that this dominates the one-round scheme. Extensions of the results to the special case when all the latency functions are linear are also presented. Our results extend the earlier results and answer an open question posed by Roughgarden [Ro01]. Basic and Applied Simulation Science (D-2) Los Alamos National Laboratory, P. O. Box 1663, MS M997, Los Alamos NM 87545. The work is supported by the Department of Energy under Contract W-7405-ENG-36. Email: anil,[email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems

In proof-of-payment transit systems, passengers are legally required to purchase tickets before entering but are not physically forced to do so. Instead, patrol units move about the transit system, inspecting the tickets of passengers, who face fines if caught fare evading. The deterrence of such fines depends on the unpredictability and effectiveness of the patrols. In this paper, we present T...

متن کامل

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory

In proof-of-payment transit systems, passengers are legally required to purchase tickets before entering but are not physically forced to do so. Instead, patrol units move about the transit system, inspecting the tickets of passengers, who face fines if caught fare evading. The deterrence of fare evasion depends on the unpredictability and effectiveness of the patrols. In this paper, we present...

متن کامل

Design of Incentive Compatible Mechanisms for Stackelberg Problems

This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg problems. These are problems where the decisions or actions in successive layers of the hierarchy are taken in a sequential way while decisions or actions within each layer are taken in a simultaneous manner. There are m...

متن کامل

Stackelberg Scheduling Strategies (DRAFT – DO NOT DISTRIBUTE)

We study the problem of optimizing the performance of a system shared by selfish, noncooperative users. We consider the concrete setting of scheduling jobs on a set of shared machines with loaddependent latency functions specifying the length of time necessary to complete a job; we measure system performance by the total latency of the system. Assigning jobs according to the selfish interests o...

متن کامل

Scalable Randomized Patrolling for Securing Rapid Transit Networks

Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols for improving security of such rail networks. Similar to existing work in randomised patrols for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002